Experimental Study of Multipopulation Parallel Genetic Programming
نویسندگان
چکیده
The parallel execution of several populations in Evolutionary Algorithms has usually given good results. Nevertheless, researchers have to date drawn conflicting conclusions when using some of the Parallel Genetic Programming models. One aspect of the conflict is population size, since published GP works do not agree about whether to use large or small populations. This paper presents an experimental study of a number of common GP test problems. Via our experiments, we discovered that an optimal range of values exists. This assists us in our choice of population size and in the selection of an appropriate Parallel Genetic Programming model. Finding efficient parameters helps us to speed up our search for solutions. At the same time, it allows us to locate features that are common to Parallel Genetic Programming and the classic Genetic Programming Technique.
منابع مشابه
Diversity analysis in cellular and multipopulation genetic programming
This paper presents a study that evaluates the influence of the parallel genetic programming (GP) models in maintaining diversity in a population. The parallel models used are the cellular and the multipopulation one. Several measures of diversity are considered to gain a deeper understanding of the conditions under which the evolution of both models is successful. Three standard test problems ...
متن کاملExperimental Study of Isolated Multipulation Genetic Programming
In this paper we present some results obtained when comparing classic Genetic Programming (GP) with the isolated multipopulation version. Our first discovery was that sometimes, given a certain number of individuals, it is useful to distribute them among several populations even when no communication is allowed. 1 ISOLATED MULTIPOPULATIONS GENETIC PROGRAMMING Using a large population is not alw...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...
متن کاملA theory of the phenomenology of Multipopulation Genetic Algorithm with an application to the Ising model
Genetic algorithm (GA) is a stochastic metaheuristic process consisting on the evolution of a population of candidate solutions for a given optimization problem. By extension, multipopulation genetic algorithm (MPGA) aims for efficiency by evolving many populations, or “islands”, in parallel and performing migrations between them periodically. The connectivity between islands constrains the dir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000